Model Checking Systems Against Epistemic Specifications

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Model Checking Distributed Systems against Temporal-Epistemic Specifications

Concurrency and message reordering are two main causes for the state-explosion in distributed systems with asynchronous communication. We study this domain by analysing ABS, an executable modelling language for object-based distributed systems and present a symbolic model checking methodology for verifying ABS programs against temporal-epistemic specifications. Specifically, we show how to map ...

متن کامل

Model Checking Multi-Agent Systems against Epistemic HS Specifications with Regular Expressions

We introduce EHS, a novel temporal-epistemic logic defined on temporal intervals characterised by regular expressions. We investigate the complexity of verifying multi-agent systems against EHS specifications for a number of fragments of EHS with results ranging from PSPACE-completeness to non-elementary time. The findings show that, at least for the fragments under analysis, the increase in ex...

متن کامل

Model Checking Multi-Agent Systems against LDLK Specifications

We define the logic LDLK, a formalism for specifying multi-agent systems. LDLK extends LDL with epistemic modalities, including common knowledge, for reasoning about evolution of knowledge states of agents in the system. We show that the problem of verifying multi-agent systems against LDLK specifications is PSPACE-complete. We give an algorithm for practical verification of multiagent systems ...

متن کامل

Symbolic Model Checking Multi-Agent Systems against CTL*K Specifications

We introduce a technique for model checking multi-agent systems against temporal-epistemic specifications expressed in the logic CTL∗K. We present an algorithm for the verification of explicit models and use this to show that the problem is PSPACE-complete. We show that the technique is amenable to symbolic implementation via binary decision diagrams. We introduce MCMAS∗, a toolkit based on the...

متن کامل

Model checking RAISE specifications

This report presents the basic foundations for the verification by means of model checking techniques of formal specifications expressed in RAISE. During this work, third party model checkers are briefly discussed and analysed for suitability under two main criteria: (a) syntactic/semantic restrictions imposed by the model checker’s language and (b) the applied representation technique for the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science

سال: 2014

ISSN: 2075-2180

DOI: 10.4204/eptcs.146.0.3